Search results for "Fast algorithm"
showing 7 items of 7 documents
Implementation of algorithms forK shortest loopless paths
1986
Implementations of loopless k shortest path algorithms are examined. Efficient storage structures for a large number of paths are given. A fast algorithm for determining the shortest paths in Yen's method is developed. Timing experiments show that a hybrid of Clarke's and Yen's methods is generally the fastest, although not significantly. Using upper bounds for the lengths of paths essentially improves all methods.
ADT implementation and completion by induction from examples
1991
There exists a fast algorithm [2] for inductive synthesis of terminating and ground confluent term rewriting systems from samples. The principles of this algorithm and the methodology of its use for implementation and completion of abstract data types are described.
Inductive synthesis of term rewriting systems
2005
Fast algorithm for inductive synthesis of term rewriting systems is described and proved to be correct. It is implemented and successfully applied for inductive synthesis of different algorithms, including the binary multiplication. The algorithm proposed supports automatic learning process and can be used for designing and implementation of ADT.
A fast algorithm for muon track reconstruction and its application to the ANTARES neutrino telescope.
2011
An algorithm is presented, that provides a fast and robust reconstruction of neutrino induced upward-going muons and a discrimination of these events from downward-going atmospheric muon background in data collected by the ANTARES neutrino telescope. The algorithm consists of a hit merging and hit selection procedure followed by fitting steps for a track hypothesis and a point-like light source. It is particularly well-suited for real time applications such as online monitoring and fast triggering of optical follow-up observations for multi-messenger studies. The performance of the algorithm is evaluated with Monte Carlo simulations and various distributions are compared with that obtained …
Hybrid robust and fast algorithm for three-dimensional phase unwrapping
2009
We present a hybrid three-dimensional (3D) unwrapping algorithm that combines the strengths of two other fast and robust existing techniques. In particular, a branch-cut surface algorithm and a path-following method have been integrated in a symbiotic way, still keeping execution times within a range that permits their use in real-time applications that need a relatively fast solution to the problem. First, branch-cut surfaces are calculated, disregarding partial residue loops that end at the boundary of the 3D phase volume. These partial loops are then used to define a quality for each image voxel. Finally, unwrapping proceeds along a path determined by a minimum spanning tree (MST). The M…
Hot-spot detection and characterization of strombolian activity from MODIS infrared data
2014
Identifying and characterizing strombolian activity from space is a challenging task for satellite-based infrared systems. Stromboli volcano is a natural laboratory that offers a unique opportunity for refining thermal remote-sensing applications that involve transient phenomena and small to moderate hot-spots. A new simple and fast algorithm gave us the opportunity to revisit the MODIS-derived thermal output at Stromboli volcano over the last 13 years. The new algorithm includes both night-time and daytime data and shows high performance with the detection of small-amplitude thermal anomalies ( 1000 MW). The ...
Fast algorithm for detection of reference spheres in digital panoramic radiography.
2009
In this paper, an algorithm for detection of reference spheres from digital panoramic radiographic images is presented. The proposed algorithm was tested on a database of 107 digital panoramic radiographic images which were used for dental diagnostics. Results show that the proposed method exhibits for detection of reference spheres, a sensitivity of 97.33% and specificity of 93.85%. Performance time differed between 0.55 and 2.36s depending on image size. The aim of this work was to provide a fast ellipse detection algorithm to reduce measuring time on preoperative implant planning by lowering the computational cost.